翻訳と辞書 |
Brodal queue : ウィキペディア英語版 | Brodal queue In computer science, the Brodal queue is a heap/priority queue structure with very low worst case time bounds: for insertion, find-minimum, meld (merge two queues) and decrease-key and for delete-minimum and general deletion; they are the first heap variant with these bounds. Brodal queues are named after their inventor Gerth Stølting Brodal.〔Gerth Stølting Brodal (1996). Worst-case efficient priority queues. Proc. 7th ACM-SIAM Symposium on Discrete Algorithms, pp. 52–58〕 While having better asymptotic bounds than other priority queue structures, they are, in the words of Brodal himself, "quite complicated" and "() applicable in practice."〔 Brodal and Okasaki describe a persistent (functional) version of Brodal queues.〔Gerth Stølting Brodal and Chris Okasaki (1996). (Optimal purely functional priority queues ). J. Functional Programming.〕 ==References== 〔
抄文引用元・出典: フリー百科事典『 ウィキペディア(Wikipedia)』 ■ウィキペディアで「Brodal queue」の詳細全文を読む
スポンサード リンク
翻訳と辞書 : 翻訳のためのインターネットリソース |
Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.
|
|